منابع مشابه
A decade of CGAL
The Computational Geometry Algorithms Library CGAL is the largest and most influential collection of algorithms and data structures for geometric computing that is available today. It started off in 1996 as a European research project with a small number of partners. Over the last ten years, it has grown tremendously, now being a major open source project with a lot of infrastructure (see www.c...
متن کاملThe CGAL Kernel : A Basis for
A large part of the cgal-project is devoted to the development of a Computational Geometry Algorithms Library, written in C++. We discuss design issues concerning the cgal-kernel which is the basis for the library and hence for all geometric computation in cgal.
متن کاملTriangulations in CGAL
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.
متن کاملVoronoi diagrams in Cgal
In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graph...
متن کاملGeometric Computing: Introduction to CGAL
Here is a preliminary list of possible project topics. For some of them there one or more relevant chapters in [12]. If you decide on a project and can’t get the related papers on the web (due to access priveledges), please let me know and I will send you the papers. The references given here are indicative, you can find more (and perhaps better ones) if you search around. (More information on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2007
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.02.001